Duality and the Completeness of the Modal mu-Calculus

نویسندگان

  • Simon Ambler
  • Marta Z. Kwiatkowska
  • Nicholas Measor
چکیده

We consider the modal-calculus due to Kozen, which is a nitary modal logic with least and greatest xed points of monotone operators. We extend the existing duality between the category of modal algebras with homomorphisms and the category of descriptive modal frames with contractions to the case of having xed point operators. As a corollary, we obtain completeness results for two proof systems due to Kozen ((nitary and innnitary) with respect to certain classes of modal frames. The rules are sound in every model, not only for validity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness for μ-calculi: a coalgebraic approach

We set up a generic framework for proving completeness results for variants of the modal mucalculus, using tools from coalgebraic modal logic. We illustrate the method by proving two new completeness results: for the graded mu-calculus (which is equivalent to monadic second-order logic on the class of unranked tree models), and for the monotone modal mu-calculus. Besides these main applications...

متن کامل

On the Proof Theory of the Modal mu-Calculus

We study the proof theoretic relationship between several deductive systems for the modal mu-calculus. This results in a completeness proof for a system that is suitable for deciding the validity problem of the mu-calculus. Moreover, this provides a new proof theoretic proof for the finite model property of the mu-calculus.

متن کامل

Completeness for the modal μ-calculus: separating the combinatorics from the dynamics

The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result with respect to the Kripke-style semantics of the logic. The problem of proving Kozen’s axiom system co...

متن کامل

Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus

Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.

متن کامل

Disjunctive bases: normal forms and model theory for modal logics

We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 151  شماره 

صفحات  -

تاریخ انتشار 1995